Scalable Problems and Memory-Bounded Speedup
نویسندگان
چکیده
منابع مشابه
Scalable Problems and Memory-bounded Speedup Scalable Problems and Memory-bounded Speedup
In this paper three models of parallel speedup are studied. They are xed-size speedup, xed-time speedup and memory-bounded speedup. The latter two consider the relationship between speedup and problem scalability. Two sets of speedup formulations are derived for these three models. One set considers uneven workload allocation and communication overhead, and gives more accurate estimation. Anoth...
متن کاملScalable Problems and Memory-Bounded Speedup
In this paper three models of parallel speedup are studied. They are fixed-size speedup, fixed-time speedup and memory-bounded speedup. The latter two consider the relationship between speedup and problem scalability. Two sets of speedup formulations are derived for these three models. One set considers uneven workload allocation and communication overhead, and gives more accurate estimation. A...
متن کاملSpeedup for Natural Problems
Informally, a language L has speedup if, for any Turing machine (TM) for L, there exists one that is better. Blum [1] showed that there are computable languages that have almost-everywhere speedup. These languages were unnatural in that they were constructed for the sole purpose of having such speedup. We identify an intuitive condition which, like several others in the literature, implies that...
متن کاملFixed Time, Tiered Memory, and Superlinear Speedup
In the problem size-ensemble size plane, fixed-sized and scaled-sized paradigms have been the subsets of primary interest to the parallel processing community. A problem with the newer scaled-sized model is that execution time increases for problems where operation complexity grows faster than storage complexity. The fixed time model is introduced, which, unlike the scaled model, implies the ne...
متن کاملSpeedup for natural problems and noncomputability
A resource-bounded version of the statement “no algorithm recognizes all non-halting Turing machines” is equivalent to an infinitely often (i.o.) superpolynomial speedup for the time required to accept any (paddable) coNPcomplete language and also equivalent to a superpolynomial speedup in proof length in propositional proof systems for tautologies, each of which implies P 6= NP. This suggests ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 1993
ISSN: 0743-7315
DOI: 10.1006/jpdc.1993.1087